Perturbation on Polynomials
نویسندگان
چکیده
منابع مشابه
Perturbation Bounds for Determinants and Characteristic Polynomials
We derive absolute perturbation bounds for the coefficients of the characteristic polynomial of a n × n complex matrix. The bounds consist of elementary symmetric functions of singular values, and suggest that coefficients of normal matrices are better conditioned with regard to absolute perturbations than those of general matrices. When the matrix is Hermitian positivedefinite, the bounds can ...
متن کاملPerturbation of Complex Polynomials and Normal Operators
We study the regularity of the roots of complex monic polynomials P (t) of degree n depending smoothly on a real parameter t. If P (t) is C∞ and no two of the continuously chosen roots meet of infinite order of flatness, then there exists a locally absolutely continuous parameterization of the roots. Simple examples show that the conclusion is best possible. This result will follow from the pro...
متن کاملEstimating roots of polynomials using perturbation theory
Perturbation theory and the order of magnitude of terms are employed to develop two theorems. The theorems may be useful to estimate the order of magnitude of the roots of a polynomial a priori before solving the equation. The theorems are developed for two special types of polynomials of arbitrary order with their coefficients satisfying certain conditions. Numerical applications of the theore...
متن کاملDenjoy-carleman Differentiable Perturbation of Polynomials and Unbounded Operators
Let t 7→ A(t) for t ∈ T be a C -mapping with values unbounded operators with compact resolvents and common domain of definition which are self-adjoint or normal. Here C stands for C (real analytic), a quasianalytic or non-quasianalytic Denjoy-Carleman class, C∞, or a Hölder continuity class C. The parameter domain T is either R or R or an infinite dimensional convenient vector space. We prove a...
متن کاملPerturbation, Computation and Refinement of Invariant Subspaces for Matrix Polynomials
Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of linear eigenvalue problems, leading to conceptually elegant and numerically stable formulations in applications that require the computation of several eigenvalues and/or eigenvectors. Similar benefits can be expected for polynomial eigenvalue problems, for which the concept of invariant subspac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics Research
سال: 2013
ISSN: 1916-9809,1916-9795
DOI: 10.5539/jmr.v5n3p51